Automorphisms of a Free Associative Algebra of Rank 2. I

نویسندگان

  • ANASTASIA J. CZERNIAKIEWICZ
  • A. J. CZERNIAKIEWICZ
چکیده

Let Ä<2> = R that keeps (xy — yx) fixed (up to multiplication by an element of R), then . This follows from a more general result about endomorphisms of Ä<2> via a theorem due to H. Jung [6] concerning automorphisms of a commutative and associative algebra of rank 2. Introduction. Let F be a commutative domain with 1. We will further assume that every invertible matrix with coefficients in F is a product of elementary matrices (e.g. F a field, F a Euclidean domain). Let F be the free associative algebra of rank n over F. It has been conjectured (see P. M. Cohn [1, p. 33]) that every F automorphism of F is tame (i.e. a product of elementary automorphisms of F). The conjecture has been proved true for a free Lie algebra by P. M. Cohn [3], and for R(x,y), the free commutative and associative algebra of rank 2 (i.e. the polynomial ring in 2 commuting indeterminates x and y) by Jung [6]. We shall prove here that a certain class of automorphisms of F<2> satisfies the conjecture, namely that if F so that [A, B] = X[x, y], X a unit of F, is it true that A and B generate F<2>? We prove that the answer is "yes" if A=x + P, B=y+ Q, where F and Q satisfy condition (iii) below. The following is an outline of our proof. Given <p e AutB (R(.x, y}) so that <p keeps (xy—yx) fixed, Jung's theorem allows us to reduce the problem of proving that <p is tame to the case in which the canonical projection of <p to R(x, y) is the identity. More generally we prove _ Received by the editors October 27, 1970. AMS 1970 subject classifications. Primary 16A06, 16A72; Secondary 20F55, 16A02.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finitely Generated Invariants of Hopf Algebras on Free Associative Algebras

We show that the invariants of a free associative algebra of finite rank under a linear action of a finite-dimensional Hopf algebra generated by group-like and skew-primitive elements form a finitely generated algebra exactly when the action is scalar. This generalizes an analogous result for group actions by automorphisms obtained by Dicks and Formanek, and Kharchenko.

متن کامل

Coordinates and Automorphisms of Polynomial and Free Associative Algebras of Rank Three

We study z-automorphisms of the polynomial algebra K[x, y, z] and the free associative algebra K〈x, y, z〉 over a field K, i.e., automorphisms which fix the variable z. We survey some recent results on such automorphisms and on the corresponding coordinates. For K〈x, y, z〉 we include also results about the structure of the z-tame automorphisms and algorithms which recognize z-tame automorphisms ...

متن کامل

Constants of Weitzenböck Derivations and Invariants of Unipotent Transformations Acting on Relatively Free Algebras

In commutative algebra, a Weitzenböck derivation is a nonzero triangular linear derivation of the polynomial algebra K[x1, . . . , xm] in several variables over a field K of characteristic 0. The classical theorem of Weitzenböck states that the algebra of constants is finitely generated. (This algebra coincides with the algebra of invariants of a single unipotent transformation.) In this paper ...

متن کامل

Automorphisms fixing a variable of K〈x, y

We study automorphisms φ of the free associative algebra K〈x, y, z〉 over a field K such that φ(x), φ(y) are linear with respect to x, y and φ(z) = z. We prove that some of these automorphisms are wild in the class of all automorphisms fixing z, including the well known automorphism discovered by Anick, and show how to recognize the wild ones. This class of automorphisms induces tame automorphis...

متن کامل

Automorphic Equivalence Problem for Free Associative Algebras of Rank Two

Let K〈x, y〉 be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not two elements in K〈x, y〉 are equivalent under an automorphism of K〈x, y〉. A modification of our algorithm solves the problem whether or not an element in K〈x, y〉 is a semiinvariant of a nontrivial automorphism. In partic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010